An Integer Programming-based Local Search for Large-Scale Multidimensional Knapsack Problems
نویسندگان
چکیده
Integer programming-based local search (IPbLS) is a metaheuristic recently proposed for solving linear combinatorial optimization problems. IPbLS is basically the same as the first-choice hillclimbing except for using integer programming for neighbor generation. Meanwhile, the multidimensional knapsack problem (MKP) is one of the most well-known linear combinatorial optimization problems and has received wide attention. Integer programming (IP) is very effective for small-scale or mid-scale MKP but suffers from large memory requirement for large-scale MKP. In this paper, we present an IPbLS for solving large-scale MKP. First, an initial solution is generated by IP, and then neighbor solutions are repeatedly obtained by IP using problem reduction. We used the largest 30 problem instances available on the OR-Library as experimental data. The proposed method could find better solutions than the best-known solutions for 6 problem instances. Furthermore, we confirmed that our average result of the best solutions outperforms the result of the best-known method. Keywords-Multidimensional Knapsack Problem; Integer Programming; Integer Programming-based Local Search
منابع مشابه
A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملAn Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs
First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...
متن کاملUpper Bounds for Large Scale Integer Quadratic Multidimensional Knapsack Problems
We consider the separable quadratic multi-knapsack problem (QMKP) which consists in maximizing a concave separable quadratic integer function subject to m linear capacity constraints. The aim of this paper is to develop an effective method to compute an upper bound for (QMKP) from a surrogate relaxation originally proposed in Djerdjour et al. (1988). The quality of three other upper bounds for...
متن کاملAn Integer Programming-based Local Search for Large-scale Maximal Covering Problems
Maximal covering problem (MCP) is classified as a linear integer optimization problem which can be effectively solved by integer programming technique. However, as the problem size grows, integer programming requires excessive time to get an optimal solution. This paper suggests a method for applying integer programming-based local search (IPbLS) to solve large-scale maximal covering problems. ...
متن کاملVery Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems
Very large-scale neighborhood search (VLSNS) is a technique intensively used in single-objective optimization. However, there is almost no study of VLSNS for multiobjective optimization. We show in this paper that this technique is very efficient for the resolution of multiobjective combinatorial optimization problems. Two problems are considered: the multiobjective multidimensional knapsack pr...
متن کامل